Comments on "Performance Analysis of a Deterministic Channel Estimator for Block Transmission Systems With Null Guard Intervals"

نویسندگان

  • Borching Su
  • P. P. Vaidyanathan
چکیده

In the above-mentioned paper a Cramer-Rao bound was derived for the performance of a blind channel estimation algorithm. In this paper an error in the bound is pointed out and corrected. It is observed here that the performance of the said algorithm does not achieve the Cramer-Rao bound. In the above paper [1], important work has been done to analyze the algorithm in [2] which solves a blind channel estimation problem. The performance of the algorithm in [2] in high SNR region was shown to be as in (33) of [1]. The Cramer-Rao bound (CRB) of the above mentioned blind estimation problem was shown to be as in (49) of [1]. The coincidence of (33) and (49) led the authors of [1] to claim that the algorithm in [2] is statistically efficient (i.e., achieves the CRB) at high SNR values. However, we have found an error in the derivation of (49), which invalidates this claim. Eq. (49) of [1] was derived from (80) in Appendix B of [1]. The second equality of (80) is not valid in general since it is conditioned on the validity of the matrix identity (ABAH)−1 = AH†B−1A† (1) where A is a full rank matrix with more columns than rows and B is a square positive definite matrix. But a simple example shows that this identity is not true in general: set A = [ 1 0 0 0 1 0 ] , and B =   1 0 0 0 1 1 0 1 2   , then the left hand side of (1) is I2 whereas the right hand side

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance analysis of a deterministic channel estimator for block transmission systems with null guard intervals

A deterministic algorithm was recently proposed for channel identification in block communication systems. The method assumed that the channel is FIR and null guard intervals of length greater than the channel order are inserted between successive blocks to prevent inter-block interfence and allow block synchronization. In the absence of noise the algorithm provides error-free channel estimates...

متن کامل

Avoidance of Guard Periods in Block Transmission Systems

To meet the requirement of efficient cancellation of inter symbol interference (ISI) in high data rate transmissions over time dispersive channels block based transmissions are often adopted. This is the case in orthogonal frequency domain multiplexing (OFDM), cyclic prefix based single carrier (CP-SC) and block transmissions with null guard periods (ZP-SC). Guard periods are inserted between t...

متن کامل

Extension of the Coverage Region of Multiple Access Channels by Using a Relay

From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...

متن کامل

A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...

متن کامل

A Cramer-Rao Bound for Semi-Blind Channel Estimation in Redundant Block Transmission Systems

A Cramér-Rao bound (CRB) for semi-blind channel estimators in redundant block transmission systems is derived. The derived CRB is valid for any system adopting a full-rank linear redundant precoder, including the popular cyclicprefixed orthogonal frequency-division multiplexing system. Simple forms of CRBs for multiple complex parameters, either unconstrained or constrained by a holomorphic fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2008